-
1 DLP
1) Общая лексика: ДППБД, Дата прекращ (Дата, с которой прекращается рассмотрение данных при подготовке очередного PSUR (периодического обновляемого отчёта о безопасности препарата) http://www.ema.europa.eu/htms/vet/postguidance/q66.htm)2) Компьютерная техника: Data Leak Prevention3) Военный термин: Defense Language Program, Director of Laboratory Programs, Doctrinal Literature Program4) Техника: double-layer polysilicon5) Строительство: период ответственности за дефекты (Defects Liability Period), Direct Pressure Laminate6) Фармакология: Data Lock Point(s)7) Австралийский сленг: Democratic Labor Party8) Оптика: digital light processing9) Политика: Drunken Lan Party10) Сокращение: Digital Light Projection, direct letter perfect, Data Lock Point11) Вычислительная техника: Discrete Logarithmic Problem, data link processor, display-list processing, Digital Light Processing (TI)12) Биотехнология: dual-labeled probes13) Образование: Daily Language Practice, Developmental Learning Program14) Микроэлектроника: цифровая проекция, цифровая проекция изображения15) Сетевые технологии: Desktop Link Protocol, процессор передачи данных16) Имена и фамилии: Daniel L Perez17) NYSE. Delta & Pine Land Company18) Программное обеспечение: Digital Light Processor -
2 time
1) время; период времени2) момент времени || отмечать время3) хронометрировать; рассчитывать по времени4) синхронизировать; согласовывать во времени•- access time
- accumulated operating time
- action time
- activity slack time
- actual activity completion time
- actual time
- actuation time
- addition time
- add time
- add-subtract time
- arrival time
- assembly time
- attended time
- available machine time
- average operation time
- awaiting-repair time
- binding time
- bit time
- build-up time
- calculating time
- carry-over time
- carry time
- chip-access delay time
- circuit time
- clear-write time
- coding time
- compile time
- computation time
- computer dead time
- computer time
- computer useful time
- computing time
- connect time
- control time
- crash time
- crisis time
- cycle time
- data time
- data-retention time
- dead time
- debatable time
- debugging time
- debug time
- decay time
- deceleration time
- delay time
- design time
- destination time
- development time
- digit time
- discrete time
- divide time
- down time
- earliest expected time
- effective time
- engineering time
- entry time
- error-free running time
- estimated time
- event scheduled completion time
- event slack time
- event time
- execution cycle time
- execution time
- expected activity time
- fall time
- fault correction time
- fault location time
- fault time
- fetch time
- float time
- form movement time
- forward-current rise time
- gate time
- good time
- guard time
- handshaking time
- holding time
- hold time
- idle time
- improvement time
- incidental time
- ineffective time
- inoperable time
- installation time
- instruction time
- integrator time
- interaction time
- interarrival time
- interrogation time
- latency time
- latest allowable event time
- load time
- lock-grant time
- lock-holding time
- logarithmic time
- machine available time
- machine spoiled work time
- machine spoiled time
- machine time
- maintenance time
- makeup time
- manual time
- mean error-free time
- mean repair time
- mean time between errors
- mean time between failures
- mean time to repair
- memory cycle time
- miscellaneous time
- mission time
- most likely time
- multiply time
- no-charge machine fault time
- no-charge non-machine-fault time
- no-charge time
- nonfailure operating time
- nonreal time
- nonscheduled down time
- nonscheduled maintenance time
- object time
- occurrence time
- off time
- on time
- one-pulse time
- operating time
- operation time
- operation-use time
- optimistic time
- out-of-service time
- peaking time
- peak time
- pessimistic time
- polynomial time
- pool time
- positioning time
- power up time
- pre-assembly time
- precedence waiting time
- preset time
- preventive maintenance time
- print interlock time
- problem time
- processing time
- process time
- processor cycle time
- production time
- productive time
- program execution time
- program fetch time
- program testing time
- progration time
- propagation delay time
- proving time
- pulse time
- punch start time
- read time
- reading access time
- readout time
- read-restore time
- real time
- record check time
- recovery time
- reference time
- refresh time
- reimbursed time
- repair delay time
- repair time
- representative computing time
- request-response time
- resetting time
- resolution time
- resolving time
- response time
- restoration time
- restoring time
- retrieval time
- reversal time
- reverse-current fall time
- rewind time
- rise time
- round-trip time
- routine maintenance time- run time- sampling time
- scaled real time
- scheduled time
- schedule time
- scheduled down time
- scheduled operating time
- scramble time
- screen storage time
- search time
- seek time
- send-receive-forward time
- sensitive time
- service time
- serviceable time
- setting time
- settling time
- setup time
- simulated time
- s-n transition time
- standby time
- starting time
- start time
- start-up time
- stop time
- storage cycle time
- storage time
- subtraction time
- subtract time
- superconducting-normal transition time
- supplementary maintenance time
- swap time
- switch delay time
- switch time
- switching time
- system time
- takedown time
- task time
- testing time
- throughput time
- time between failures
- time for motion to start
- time now
- total time
- track-to-track move time
- transfer time
- transit time
- transition time
- translating time
- true time
- turnaround time
- turnoff time
- turnon time
- turnover time
- unacked time
- unattended standby time
- unattended time
- unavailable time
- unit time
- unused time
- up time
- useful time
- user time
- variable dead time
- waiting time
- word time
- word-addressing time
- write timeEnglish-Russian dictionary of computer science and programming > time
См. также в других словарях:
Uniform distribution (discrete) — discrete uniform Probability mass function n = 5 where n = b − a + 1 Cumulative distribution function … Wikipedia
Travelling salesman problem — The travelling salesman problem (TSP) is an NP hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest… … Wikipedia
Art gallery problem — The art gallery problem or museum problem is a well studied visibility problem in computational geometry. It originates from a real world problem of guarding an art gallery with the minimum number of guards which together can observe the whole… … Wikipedia
DLP — abbr. Digital Light Processing (TI) abbr. Discrete Logarithmic Problem comp. abbr. Digital Light Processing (TI) … United dictionary of abbreviations and acronyms
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
Cycle detection — This article is about iterated functions. For another use, see Cycle detection (graph theory). In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values. For any function ƒ that… … Wikipedia
Key size — In cryptography, key size or key length is the size measured in bits[1] of the key used in a cryptographic algorithm (such as a cipher). An algorithm s key length is distinct from its cryptographic security, which is a logarithmic measure of the… … Wikipedia
Logarithm — The graph of the logarithm to base 2 crosses the x axis (horizontal axis) at 1 and passes through the points with coordinates (2, 1), (4, 2), and (8, 3) … Wikipedia
2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… … Wikipedia
List of mathematics articles (L) — NOTOC L L (complexity) L BFGS L² cohomology L function L game L notation L system L theory L Analyse des Infiniment Petits pour l Intelligence des Lignes Courbes L Hôpital s rule L(R) La Géométrie Labeled graph Labelled enumeration theorem Lack… … Wikipedia
